Induction on Failing Derivations
نویسنده
چکیده
A proof technique, called induction on failing derivations, is introduced. We wish to prove properties of judgments in deductive systems. Standard techniques exist for proving such properties on valid judgments; this note defines a technique for proving such properties on invalid (underivable) judgments.
منابع مشابه
Successful Logic Programs
We formalize the intuitive reasoning which we normally use to get convinced that a query has successful LD-derivations in a program. We give two suucient conditions: one for characterizing absence of nitely failing LD-derivations (FDs) and a weaker one for guaranteeing the presence of at least one successful LD-derivation if there are nite ones. These conditions can be useful both in verifying ...
متن کاملA On Subtyping-Relation Completeness, with an Application to Iso-Recursive Types
Well-known techniques exist for proving the soundness of subtyping relations with respect to type safety. However, completeness has not been treated with widely applicable techniques, as far as we’re aware. This paper develops techniques for stating and proving that a subtyping relation is complete with respect to type safety and applies the techniques to the study of iso-recursive subtyping. A...
متن کامل$(odot, oplus)$-Derivations and $(ominus, odot)$-Derivations on $MV$-algebras
In this paper, we introduce the notions of $(odot, oplus)$-derivations and $(ominus, odot)$-derivations for $MV$-algebras and discuss some related results. We study the connection between these derivations on an $MV$-algebra $A$ and the derivations on its boolean center. We characterize the isotone $(odot, oplus)$-derivations and prove that $(ominus, odot)$-derivations are isotone. Finally we d...
متن کاملOn $n$-derivations
In this article, the notion of $n-$derivation is introduced for all integers $ngeq 2$. Although all derivations are $n-$derivations, in general these notions are not equivalent. Some properties of ordinary derivations are investigated for $n-$derivations. Also, we show that under certain mild condition $n-$derivations are derivations.
متن کاملStructural Induction in Programming Language Semantics A Note for C S 386L Students
Programming language syntax and semantics use various structured objects. Languages and derivations (proofs) are two examples. Often, one wishes to prove that a property holds for some set of these structured objects. Typically these objects are defined recursively, so induction is a natural proof approach. Structural induction is one pattern of inductive proof. In this note, we will (1) define...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013